#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, a[N];
int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);

    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + n + 1);

    int cst = 0;
    for(int i = 1; i <= n; i++) {
        int j = i;
        while(j < n && a[j + 1] == a[i]) j++;
        for(int k = i; k <= j; k++)
            if(cst < i - 1) cst++;
        i = j;
    }
    cout << n - cst << endl;
    return 0;
}
